Secure Computation
نویسنده
چکیده
Suppose your university department is about to make a job offer, and a friend tells you that their department is also about to make an offer. Are you entering into a bidding war, or are the two departments interested in different people? You open your mouth to ask, “Are you making an offer to X?” then shut it, imagining an answer of, “Actually, we were interested in someone else, but now that you’ve told me that X is available...” Your friend is similarly closed-mouthed. You are at an impasse. You both want to find out if you are interested in the same person, but you don’t want to reveal anything beyond this one bit of information. What can you do? This problem, and many others like it, makes simultaneous demands on the privacy and usability of sensitive data that go beyond the capabilities of conventional cryptography. Encrypting sensitive data is analogous to placing jewels in a safe. While in the safe, the jewels are protected from theft, but you can’t wear them to the ball. Conventionally encrypted data may be safe from prying eyes, but until it is decrypted it can’t be used, even by legitimate parties for agreed upon purposes.
منابع مشابه
Design and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملپروتکل کارا برای جمع چندسویه امن با قابلیت تکرار
In secure multiparty computation (SMC), a group of users jointly and securely computes a mathematical function on their private inputs, such that the privacy of their private inputs will be preserved. One of the widely used applications of SMC is the secure multiparty summation which securely computes the summation value of the users’ private inputs. In this paper, we consider a secure multipar...
متن کاملSecure Computation on Mobile Devices
Secure two-party computation has been an interesting theoretical concept for decades, but until recently has been considered too expensive for practical applications. With significant advances in the design and implementation of secure protocols, secure computation is becoming feasible in practice. However, with the notable exceptions of biometric identification and secure auctions, the researc...
متن کاملSecure Multi-Party Computation (Excerpts of Chapter 2)
3 Secure Multi-Party Computation 2 3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.1.1 Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.1.2 Security Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Passively Secure Multi-Party Computation . . . . . . . . . . . . . . . . . . . ...
متن کاملSecure Two-Party Computation: Generic Approach and Exploiting Specific Properties of Functions Approach
Introduced by Yao in early 1980s, secure computation is being one among the major area of research interest among cryptologists. In three decades of its growth, secure computation which can be called as two-party computation, or multiparty computation depending on the number of parties involved has experienced vast diversities. Research has been carried out by exploiting specific properties of ...
متن کاملOn Black-Box Complexity of UC Security
In this work, we study the intrinsic complexity of black-box UC secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the CRS model (and related setups). Our results involve the following: • Static UC secure computation. Designing the first static UC secure oblivious transfer protocol based on public-...
متن کامل